#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
multiset<LL>b,c;
LL a[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    for(LL i=1;i<=n;i++){
        LL x;cin>>x;a[i]=x;
    }
    for(LL i=1;i<=n;i++){
        LL x;cin>>x;b.insert(x);
    }
    for(LL i=1;i<=n;i++){
        LL x;cin>>x;c.insert(x);
    }
    sort(a+1,a+1+n);
    LL sum=0;
    for(LL i=1;i<=n;i++){
        auto it1=b.lower_bound(a[i]+1);
        if(it1==b.end()) continue;
        auto it2=c.lower_bound((*it1)+1);
        if(it2==c.end()) continue;
        sum++;
        b.erase(it1);
        c.erase(it2);
    }
    cout<<sum<<"\n";
   	return 0;
}
